A Fuzzy Syllogistic Reasoning Schema for Generalized Quantifiers

نویسندگان

  • Martin Pereira-Fariña
  • Juan Carlos Vidal
  • Félix Díaz-Hermida
  • Alberto Bugarín
چکیده

In this paper, a new approximate syllogistic reasoning schema is described that expands some of the approaches expounded in the literature into two ways: (i) a number of different types of quantifiers (logical, absolute, proportional, comparative and exception) taken from Theory of Generalized Quantifiers and similarity quantifiers, taken from statistics, are considered and (ii) any number of premises can be taken into account within the reasoning process. Furthermore, a systematic reasoning procedure to solve the syllogism is also proposed, interpreting it as an equivalent mathematical optimization problem, where the premises constitute the constraints of the searching space for the quantifier in the conclusion.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generating Ontologies from Relational Data with Fuzzy-Syllogistic Reasoning

Existing standards for crisp description logics facilitate information exchange between systems that reason with crisp ontologies. Applications with probabilistic or possibilistic extensions of ontologies and reasoners promise to capture more information, because they can deal with more uncertainties or vagueness of information. However, since there are no standards for either extension, inform...

متن کامل

The probability heuristics model of syllogistic reasoning.

A probability heuristic model (PHM) for syllogistic reasoning is proposed. An informational ordering over quantified statements suggests simple probability based heuristics for syllogistic reasoning. The most important is the "min-heuristic": choose the type of the least informative premise as the type of the conclusion. The rationality of this heuristic is confirmed by an analysis of the proba...

متن کامل

On the analysis of set-based fuzzy quantified reasoning using classical syllogistics

Syllogism is a type of deductive reasoning involving quantified statements. The syllogistic reasoning scheme in the classical Aristotelian framework involves three crisp term sets and four linguistic quantifiers, for which the main support is the linguistic properties of the quantifiers. A number of fuzzy approaches for defining an approximate syllogism have been proposed for which the main sup...

متن کامل

Some arguments are probably valid: Syllogistic reasoning as communication

Syllogistic reasoning lies at the intriguing intersection of natural and formal reasoning, of language and logic. Syllogisms comprise a formal system of reasoning yet use natural language quantifiers, and invite natural language conclusions. How can we make sense of the interplay between logic and language? We develop a computational-level theory that considers reasoning over concrete situation...

متن کامل

Approximate Reasoning with Fuzzy-Syllogistic Systems

The well known Aristotelian syllogistic system consists of 256 moods. We have found earlier that 136 moods are distinct in terms of equal truth ratios that range in τ=[0,1]. The truth ratio of a particular mood is calculated by relating the number of true and false syllogistic cases the mood matches. A mood with truth ratio is a fuzzy-syllogistic mood. The introduction of (n-1) fuzzy existentia...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Fuzzy Sets and Systems

دوره 234  شماره 

صفحات  -

تاریخ انتشار 2014